Papers with greedy strategy
MTGP: Multi-turn Target-oriented Dialogue Guided by Generative Global Path with Flexible Turns (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches focus on global planning, which plans toward the target before the conversation. |
| Approach: | They propose to generate a global path as a natural language sentence instead of a sequence of nodes. |
| Outcome: | The proposed method has fewer turns, more coherent semantics, and higher success rate than baselines. |
PDF-to-Tree: Parsing PDF Text Blocks into a Tree (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies try to extract one universal reading order for PDF files, however, some applications, like Retrieval Augmented Generation, require breaking long articles into sections and subsections for better indexing. |
| Approach: | They propose a new task and dataset, PDF-to-Tree, which organizes the text blocks of a PDF into a tree structure. |
| Outcome: | The proposed parser achieves 93.93% accuracy, surpassing baseline methods by 6.72%. |
Nash-Pruned CredMAS: Dynamic Panel Pruning for VLM-MAS using Nash-based Selection and Doubly-Robust Credits (2026.findings-acl)
Copied to clipboard
| Challenge: | Multi-Agent Systems (MAS) are expensive due to static panel designs, where all N agents communicate at every T round. |
| Approach: | They propose an economic framework that transforms agent selection into a dynamic resource allocation game. |
| Outcome: | The proposed system reduces token consumption by over 25% on challenging benchmarks while reducing token consumption. |